Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
نویسندگان
چکیده
منابع مشابه
Optimal Gram-schmidt Type Algorithms
A Gram-Schmidt type algorithm is given for finite d-dimensional reflexive forms over division rings. The algorithm uses d/3 + O(d) ring operations. Next, that algorithm is adapted in two new directions. First a sequential algorithm is given whose complexity matches the complexity of matrix multiplication. Second, a parallel NC algorithm is given with similar complexity.
متن کاملParallel Sparse Modified Gram-Schmidt QR Decomposition
We present a parallel algorithm for the QR decomposition with column pivoting of a sparse matrix by means of Modiied Gram-Schmidt orthogonalization. Nonzero elements of the matrix M to decompose are stored in a one-dimensional doubly linked list data structure. A strategy to reduce ll-in is discussed to get memory savings and decrease the computation times. As an application of QR decomposition...
متن کاملAnother Proof for Modified Gram-schmidt with Reorthogonalization
In this note, we consider the modified Gram-Schmidt algorithm with reorthogonalization applied on a numerical nonsingular matrix, we explain why the resulting set of vectors is orthogonal up to the machine precision level. To establish this result, we show that a certain L-criterion is necessarily verified after the second reorthogonalization step, then we prove that this L-criterion implies th...
متن کاملFPGA-based Normalization for Modified Gram-Schmidt Orthogonalization
Eigen values evaluation is an integral but computation-intensive part for many image and signal processing applications. Modified Gram-Schmidt Orthogonalization (MGSO) is an efficient method for evaluating the Eigen values in face recognition algorithms. MGSO applies normalization of vectors in its iterative orthogonal process and its accuracy depends on the accuracy of normalization. Using sof...
متن کاملSr and Sz Algorithms for the Symplectic (butterry) Eigenproblem
SR and SZ algorithms for the symplectic (generalized) eigen-problem that are based on the reduction of a symplectic matrix to symplectic butterry form are discussed. A 2n 2n symplectic butterry matrix has 8n ? 4 (generically) nonzero entries, which are determined by 4n ? 1 parameters. While the SR algorithm operates directly on the matrix entries, the SZ algorithm works with the 4n ?1 parameter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2013
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-013-0441-5